Computing global structural balance in large-scale signed social networks
نویسندگان
چکیده
منابع مشابه
Computing global structural balance in large-scale signed social networks.
Structural balance theory affirms that signed social networks (i.e., graphs whose signed edges represent friendly/hostile interactions among individuals) tend to be organized so as to avoid conflictual situations, corresponding to cycles of negative parity. Using an algorithm for ground-state calculation in large-scale Ising spin glasses, in this paper we compute the global level of balance of ...
متن کاملApplications of Structural Balance in Signed Social Networks
We present measures, models and link prediction algorithms based on the structural balance in signed social networks. Certain social networks contain, in addition to the usual friend links, enemy links. These networks are called signed social networks. A classical and major concept for signed social networks is that of structural balance, i.e., the tendency of triangles to be balanced towards i...
متن کاملLarge-scale structural organization of social networks.
The characterization of large-scale structural organization of social networks is an important interdisciplinary problem. We show, by using scaling analysis and numerical computation, that the following factors are relevant for models of social networks: the correlation between friendship ties among people and the position of their social groups, as well as the correlation between the positions...
متن کاملWalk-based measure of balance in signed networks: detecting lack of balance in social networks.
There is a longstanding belief that in social networks with simultaneous friendly and hostile interactions (signed networks) there is a general tendency to a global balance. Balance represents a state of the network with a lack of contentious situations. Here we introduce a method to quantify the degree of balance of any signed (social) network. It accounts for the contribution of all signed cy...
متن کاملMeasuring Partial Balance in Signed Networks
Is the enemy of an enemy necessarily a friend, or a friend of a friend a friend? If not, to what extent does this tend to hold? Such questions were formulated in terms of signed (social) networks and necessary and sufficient conditions for a network to be “balanced” were obtained around 1960. Since then the idea that signed networks tend over time to become more balanced has been widely used in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2011
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1109521108